package nowcoder;

import java.util.Scanner;

public class 最小公倍数 {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        int n1 = scanner.nextInt();
        int n2 = scanner.nextInt();
        System.out.println(minCommonMulti(n1, n2));
    }

    public static int minCommonMulti(int n1, int n2) {
        int commonMulti = n1 > n2 ? n1 : n2;
        while (commonMulti % n1 != 0 || commonMulti % n2 != 0) {
            commonMulti++;
        }
        return commonMulti;
    }
}
